PEBBLE GAMES FOR STUDYING STORAGE SHARINGRAVI SETHI.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 69-84; BIBL. 20 REF.Article

SCHEDULING GRAPHS ON TWO PROCESSORS.RAVI SETHI.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 73-82; BIBL. 18 REF.Article

COMPLETE REGISTER ALLOCATION PROBLEMS.RAVI SETHI.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 226-248; BIBL. 12 REF.Article

Maintaining cross references in manuscriptsAHO, A. V; RAVI SETHI.Software, practice & experience. 1988, Vol 18, Num 1, pp 1-13, issn 0038-0644Article

CONTROL FLOW ASPECTS OF SEMANTICS DIRECTED COMPILING (SUMMARY)RAVI SETHI.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 6; PP. 245-260; BIBL. 3 P.Conference Paper

Properties of a notation for combining functionsRAOULT, J.-C; RAVI SETHI.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 595-611, issn 0004-5411Article

TESTING FOR THE CHURCH-ROSSER PROPERTY.RAVI SETHI.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 671-679; BIBL. 14 REF.Article

CORRECT COMPUTATION RULES FOR RECURSIVE LANGUAGES.DOWNEY PJ; RAVI SETHI.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 378-401; BIBL. 23 REF.Article

STORAGE REQUIREMENTS FOR DETERMINISTIC POLYNOMIAL TIME RECOGNIZABLE LANGUAGES.COOK S; RAVI SETHI.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 1; PP. 25-37; BIBL. 9 REF.Article

EFFICIENT COMPUTATION OF EXPRESSIONS WITH COMMON SUBEXPRESSIONSBHASKARAM PRABHALA; RAVI SETHI.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 1; PP. 146-163; BIBL. 26 REF.Article

CODE GENERATION FOR A ONE-REGISTER MACHINE.BRUNO J; RAVI SETHI.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 502-510; BIBL. 15 REF.Article

A LEVEL ALGORITHM FOR PREEMPTIVE SCHEDULING.HORVATH EC; SHUI LAM; RAVI SETHI et al.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 1; PP. 32-43; BIBL. 10 REF.Article